Maddie & Anibel - VideoStoreAPI - Edges#12
Open
anibelamerica wants to merge 50 commits intoAda-C10:masterfrom
Open
Maddie & Anibel - VideoStoreAPI - Edges#12anibelamerica wants to merge 50 commits intoAda-C10:masterfrom
anibelamerica wants to merge 50 commits intoAda-C10:masterfrom
Conversation
Video StoreWhat We're Looking For
|
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Video Store API
Congratulations! You're submitting your assignment!
If you didn't get to the functionality the question is asking about, reply with what you would have done if you had completed it.
Comprehension Questions
O(n)where n is the number of movie records in the database since we are retrieving all movies. The time complexity of/customersis at best-case scenarioO(n)if no order is required. Otherwise, the time complexity will be based on active record's.ordermethod and will depend on the database's implementationO(n)or worse.n- is this the number of customers/movies, the number of rentals, or something else?Second, since
.ordersorts the data, we know it is at bestO(c log(c)), wherecis the number of customers.Third, when you generate JSON for a customer, you call the
movies_checked_out_countmethod, which means the time depends on the time to find the rentals for that customer - probablyO(log(r))whereris the total number of rentals, depending on how the database index is built. Then the total time would beO(c log(r) + c log(c))POST /rentals/check-inendpoint? What does the time complexity depend on? Explain your reasoning.POST /rentals/check-inendpoint is restricted by the finding the record in the db and saving it. Assuming that find queries to active record databases are modeled like a hash table, this endpoint should run inO(1)time.find_byis checking a number of properties. Usually databases use trees for indexed fields (movie_id,customer_id), and have to resort to linear search for unindexed fields (checked_out?). The database will do the faster filters first, which means you end up with something slightly worse thanO(log(r)), whereris the number of rentals.available_inventoryMovie method that returns the available inventory for an instance of a movie. We wrapped this functionality in a method since it made our controller code more readable and could also be used in our .rabl views.